On the Positivity Problem for Simple Linear Recurrence Sequences,
نویسندگان
چکیده
Given a linear recurrence sequence (LRS) over the integers, the Positivity Problem asks whether all terms of the sequence are positive. We show that, for simple LRS (those whose characteristic polynomial has no repeated roots) of order 9 or less, Positivity is decidable, with complexity in the Counting Hierarchy.
منابع مشابه
Effective Positivity Problems for Simple Linear Recurrence Sequences
We consider two computational problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem (determine whether all terms of a given LRS are positive) and the effective Ultimate Positivity Problem (determine whether all but finitely many terms of a given LRS are positive, and if so, compute an index threshold beyond which all terms are positive). We show that, f...
متن کاملUltimate Positivity is Decidable for Simple Linear Recurrence Sequences
We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine approximation concerning sums of S-units, we show that for simple LRS (those whose characteristic polynomial has no repeated roots) the Ultimate Positivity Problem is de...
متن کاملPositivity Problems for Low-Order Linear Recurrence Sequences
We consider two decision problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem (are all terms of a given LRS positive?) and the Ultimate Positivity Problem (are all but finitely many terms of a given LRS positive?). We show decidability of both problems for LRS of order 5 or less, with complexity in the Counting Hierarchy for Positivity, and in polynomi...
متن کاملPositivity of Three-Term Recurrence Sequences
In this paper, we give the sufficient conditions for the positivity of recurrence sequences defined by anun = bnun−1 − cnun−2 for n > 2, where an, bn, cn are all nonnegative and linear in n. As applications, we show the positivity of many famous combinatorial sequences.
متن کاملOn the Signs of Recurrence Sequences
We consider the following question: Which real sequences (a(n)) that satisfy a linear recurrence with constant coefficients are positive for sufficiently large n? We show that the answer is negative for both (a(n)) and (−a(n)), if the dominating characteristic roots in the representation of a(n) as a generalized power sum comprise either two pairs of conjugate complex roots or one negative real...
متن کامل